Interpretable Sequence Classification via Discrete Optimization

نویسندگان

چکیده

Sequence classification is the task of predicting a class label given sequence observations. In many applications such as healthcare monitoring or intrusion detection, early crucial to prompt intervention. this work, we learn classifiers that favour from an evolving observation trace. While state-of-the-art are neural networks, and in particular LSTMs, our take form finite state automata learned via discrete optimization. Our automata-based interpretable---supporting explanation, counterfactual reasoning, human-in-the-loop modification---and have strong empirical performance. Experiments over suite goal recognition behaviour datasets show comparable test performance LSTM-based classifiers, with added advantage being interpretable.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Interpretable SVM Classifier by Discrete-Weight Optimization

The main problem investigated in this paper is to learn ”interpretable” linear classifiers from data. Interpretable models are captured using ”discrete” linear functions. The learning problem is formulated as minimizing the cumulative zero-one loss of a discrete hyperplane, penalized by the standard L2 regularizer. This learning task is cast as a MILP problem, and solved using convex relaxation...

متن کامل

Discrete Optimization via SPSA

We consider the use of a fixed gain version of SPSA (simultaneous perturbation stochastic approximation) for optimizing a class of discrete functions. The procedure has been modified to obtain an optimization method that is applicable to cost functions defined on a grid of points in Euclidean p-space having integer components. We discuss some related results on fixed gain SPSA and describe an a...

متن کامل

Sequence classification with side effect machines evolved via ring optimization

The explosion of available sequence data necessitates the development of sophisticated machine learning tools with which to analyze them. This study introduces a sequence-learning technology called side effect machines. It also applies a model of evolution which simulates the evolution of a ring species to the training of the side effect machines. A comparison is done between side effect machin...

متن کامل

Optimization via Classification

The vast majority of population-based optimization algorithms use selection in such a way that the nonselected individuals do not have any effect on the evolution at all, even though they may carry a valueable information — information about the local shape of the search distribution and/or about the search space areas where the search should be suppressed. This article describes a unified way ...

متن کامل

Derivative-Free Optimization via Classification

Many randomized heuristic derivative-free optimization methods share a framework that iteratively learns a model for promising search areas and samples solutions from the model. This paper studies a particular setting of such framework, where the model is implemented by a classification model discriminating good solutions from bad ones. This setting allows a general theoretical characterization...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2021

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v35i11.17161